k = int(input())
a = sorted(list(map(int,input().split())))[::-1]
s = 0
t = 0
l = []
d = []
for i in a:
s+=i
d+=[s]
for j in d:
if k == 0:
print(0)
break
elif j>=k:
print(d.index(j)+1)
break
else:
print(-1)
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c=0,h,d,e,f=0,sum=0,j,cnt=0,flag=0,k=0,x,l,in1,in2,p1,p2,g,w,m=0,n;
stringstream a1,b1;
vector<string>v;
map<string,string>mp;
cin>>a;
long long aa[12];
for(int i=0;i<12;i++)
{
cin>>aa[i];
}
if(a==0)
{
cout<<0<<endl;
}
else
{
sort(aa,aa+12);
for(int i=11;i>=0;i--)
{
sum=sum+aa[i];
cnt++;
if(sum>=a)
{
flag=1;
break;
}
}
if(flag==0)
{
cout<<-1<<endl;
}
else
{
cout<<cnt<<endl;
}
}
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |